翻訳と辞書 |
Hanan grid
In geometry, the Hanan grid ''H''(''S'') of a finite set ''S'' of points in the plane is obtained by constructing vertical and horizontal lines through each point in ''S''. The main motivation for studying the Hanan grid stems from the fact that it is known to contain a rectilinear Steiner tree for ''S''.〔Martin Zachariasen, ''(A Catalog of Hanan Grid Problems )'' ''Networks'', vol. 38, 2000, pp. 200-221〕 It is named after Maurice Hanan, who was first〔Christine R. Leverenz, Miroslaw Truszczynski, (The Rectilinear Steiner Tree Problem: Algorithms and Examples using Permutations of the Terminal Set ), ''1999 ACM Southeast Regional Conference'', 1999, 〕 to investigate the rectilinear Steiner minimum tree and introduced this graph.〔M. Hanan, (On Steiner's problem with rectilinear distance ), J. SIAM Appl. Math. 14 (1966), 255 - 265.〕 == References ==
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Hanan grid」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|